MDLT: a polynomial time optimal algorithm for maximization of time-to-first- failure in energy constrained wireless broadcast networks

We consider the problem of maximizing the timeto-first-failure, defined as the time till the first node in the network runs out of battery energy, in energy constrained broadcast wireless networks. We discuss a greedy algorithm and prove that it solves the problem optimally for a broadcast application, in polynomial time, provided the complete power matrix and the battery residual capacities are known.